Average Size of Implicational Bases
نویسندگان
چکیده
Implicational bases are objects of interest in formal concept analysis and its applications. Unfortunately, even the smallest base, the Duquenne-Guigues base, has an exponential size in the worst case. In this paper, we use results on the average number of minimal transversals in random hypergraphs to show that the base of proper premises is, on average, of quasi-polynomial size.
منابع مشابه
The multiple facets of the canonical direct unit implicational basis
The notion of dependencies between ”attributes” arises in many areas such as relational databases, data analysis, data-mining, formal concept analysis, knowledge structures . . .. Formalization of dependencies leads to the notion of so-called full implicational systems (or full family of functional dependencies) which is in oneto-one correspondence with the other significant notions of closure ...
متن کاملMinimum Implicational Basis for -Semidistributive Lattices
For a ∧-semidistributive lattice L, we study some particular implicational systems and show that the cardinality of a minimum implicational basis is polynomial in the size of join-irreducible elements of the lattice L. We also provide a polynomial time algorithm to compute a minimum implicational basis for L. © 2006 Published by Elsevier B.V.
متن کاملThe Prime Stems of Rooted Circuits of Closure Spaces and Minimum Implicational Bases
A rooted circuit is firstly introduced for convex geometries (antimatroids). We generalize it for closure systems or equivalently for closure operators. A rooted circuit is a specific type of a pair (X, e) of a subset X, called a stem, and an element e 6∈ X, called a root. We introduce a notion called a ‘prime stem,’ which plays the key role in this article. Every prime stem is shown to be a ps...
متن کاملImplicational Scaling of Reading Comprehension Construct: Is it Deterministic or Probabilistic?
In English as a Second Language Teaching and Testing situations, it is common to infer about learners’ reading ability based on his or her total score on a reading test. This assumes the unidimensional and reproducible nature of reading items. However, few researches have been conducted to probe the issue through psychometric analyses. In the present study, the IELTS exemplar module C (1994) wa...
متن کاملOrdered direct implicational basis of a finite closure system
Closure system on a finite set is a unifying concept in logic programming, relational data bases and knowledge systems. It can also be presented in the terms of finite lattices, and the tools of economic description of a finite lattice have long existed in lattice theory. We present this approach by describing the so-called D-basis and introducing the concept of ordered direct basis of an impli...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
برای دانلود متن کامل این مقاله و بیش از 32 میلیون مقاله دیگر ابتدا ثبت نام کنید
ثبت ناماگر عضو سایت هستید لطفا وارد حساب کاربری خود شوید
ورودعنوان ژورنال:
- CoRR
دوره abs/1802.04032 شماره
صفحات -
تاریخ انتشار 2018